Efficient Shape Optimization Using Polynomial Chaos Expansion and Local Sensitivities

نویسندگان

  • Nam H. Kim
  • Haoyu Wang
  • Nestor V. Queipo
چکیده

This paper presents an efficient shape optimization technique based on stochastic response surfaces (polynomial chaos expansion) constructed using performance and local sensitivity data at heuristically selected collocation points. The cited expansion uses Hermite polynomial bases for the space of square-integrable probability density functions and provides a closed form solution of the performance. The focus is on calculating the uncertainty propagation using less number of function evaluations since the response surface needs to be reconstructed at each design cycle. Due to the continuum-based sensitivity analysis, the gradient information of performance is efficiently calculated and used in constructing the stochastic response surface. The efficiency and convergence of the proposed approach are demonstrated using a reliabilitybased shape optimization of a well-known structural problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust Optimal Control using Polynomial Chaos and Adjoints for Systems with Uncertain Inputs

The objective of this note is to show how one can combine Polynomial Chaos Expansions (PCE) and adjoint theory to efficiently obtain sensitivities for robust optimal control. A non-intrusive PCE method is used to analyze the constraint equations for the state (which depends on uncertain inputs), namely the governing equations of the dynamical system. Adjoint solutions are constructed for each o...

متن کامل

Design under Uncertainty Employing Stochastic Expansion Methods

Nonintrusive polynomial chaos expansion (PCE) and stochastic collocation (SC) methods are attractive techniques for uncertainty quantification due to their fast convergence properties and ability to produce functional representations of stochastic variability. PCE estimates coefficients for known orthogonal polynomial basis functions based on a set of response function evaluations, using sampli...

متن کامل

AN EFFICIENT CHARGED SYSTEM SEARCH USING CHAOS

The Charged System Search (CSS) is combined to chaos to solve mathematical global optimization problems. The CSS is a recently developed meta-heuristic optimization technique inspired by the governing laws of physics and mechanics. The present study introduces chaos into the CSS in order to increase its global search mobility for a better global optimization. Nine chaos-based CSS (CCSS) methods...

متن کامل

Post-Maneuver Collision Probability Estimation Using Sparse Polynomial Chaos Expansions

This paper describes the use of polynomial chaos expansions to approximate the probability of a collision between two satellites after at least one performs a translation maneuver. Polynomial chaos provides a computationally efficient means to generate an approximate solution to a stochastic differential equation without introducing any assumptions on the a posteriori distribution. The stochast...

متن کامل

Distributional Uncertainty Analysis of a Batch Crystallization Process Using Power Series and Polynomial Chaos Expansions

Computationally efficient approaches are presented that quantify the influence of parameter uncertainties upon the states and outputs of finite-time control trajectories for nonlinear systems. In the first approach, the worst-case values of the states and outputs due to model parameter uncertainties are computed as a function of time along the control trajectories. The approach uses an efficien...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004